Approximating the Tree and Tour Covers of a Graph
نویسندگان
چکیده
The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices form a vertex cover. Both problems are NP-hard. In this note we give strongly polynomial time, constant factor approximation algorithms for both problems. An interesting feature of our algorithms is how they combine approximations of other problems, namely the weighted vertex cover, traveling salesman, and Steiner tree problems. †Partially supported by NSF Grants CCR-9204585 and ECSE-8857642.
منابع مشابه
APPROXIMATING THE TREE AND TOUR COVERS OF A GRAPH Esther
The tree and tour cover problems on an edge-weighted graph are to compute a minimum weight tree and closed walk, respectively, whose vertices form a vertex cover. Both problems are NP-hard. In this note we give strongly polynomial time, constant factor approximation algorithms for both problems. An interesting feature of our algorithms is how they combine approximations of other problems, namel...
متن کاملApproximation algorithms for metric tree cover and generalized tour and tree covers
Given a weighted undirected graph G = (V, E), a tree (respectively tour) cover of an edge-weighted graph is a set of edges which forms a tree (resp. closed walk) and covers every other edge in the graph. The tree (resp. tour) cover problem is of finding a minimum weight tree (resp. tour) cover of G. Arkin, Halldórsson and Hassin (1993) give approximation algorithms with factors respectively 3.5...
متن کاملSociological Analyze of Women's Tour Guide Employment constraints on Tourism
Considering the necessity of women employment and the effective role of tourism in increasing job opportunities in this paper, we investigated the constraints provided by this job by using the experiences of women tour guide. The methodology in this study was qualitative and by using the Grounded Theory method. Data were collected by interviews and observations. Sampling method was targeted wit...
متن کاملGraph-TSP from Steiner Cycles
We present an approach for the traveling salesman problem with graph metric based on Steiner cycles. A Steiner cycle is a cycle that is required to contain some specified subset of vertices. For a graph G, if we can find a spanning tree T and a simple cycle that contains the vertices with odd-degree in T , then we show how to combine the classic “double spanning tree” algorithm with Christofide...
متن کاملApproximating the Minimum Tour Cover of a Digraph
Given a directed graph G with non-negative cost on the arcs, a directed tour cover T ofG is a cycle (not necessarily simple) inG such that either head or tail (or both of them) of every arc in G is touched by T . The minimum directed tour cover problem (DToCP), which is to find a directed tour cover of minimum cost, is NP -hard. It is thus interesting to design approximation algorithms with per...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 47 شماره
صفحات -
تاریخ انتشار 1993